Burrows–Wheeler transformations and de Bruijn words
نویسندگان
چکیده
منابع مشابه
Burrows-Wheeler transformations and de Bruijn words
We formulate and explain the extended Burrows–Wheeler transform ofMantaci et al. from the viewpoint of permutations on a chain taken as a union of partial order-preserving mappings. In so doing we establish a link with syntactic semigroups of languages that are themselves cyclic semigroups.We apply the extended transformwith a view to generating de Bruijn words through inverting the transform. ...
متن کاملDe Bruijn digraphs and affine transformations
Let Zd be the additive group of 1×n row vectors over Zd. For an n×nmatrix T over Zd and ω ∈ Z n d , the affine transformation FT,ω of Z n d sends x to xT +ω. Let 〈α〉 be the cyclic group generated by a vector α ∈ Zd . The affine transformation coset pseudo-digraph TCP (Zd , α, FT,ω) has the set of cosets of 〈α〉 in Z n d as vertices and there are c arcs from x+ 〈α〉 to y+ 〈α〉 if and only if the nu...
متن کاملBinary De Bruijn Partial Words with One Hole
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity function of a partial word w over a given alphabet of size k assigns to each positive integer n, the number pw(n) of distinct full words over the alphabet that are compatible with factors of length n of w. For positive intege...
متن کاملDe Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new de Bruijn cycles based on ones of lesser order. This is done by mapping a de Bruijn cycle to several vertex disjoint cycles in a de Bruijn digraph of higher order and connecting these cycles into one full cycle. We characterize homomorphisms between de Bruijn digraphs of different orders that allow this construction. These maps generalize the well-known ...
متن کاملDe Bruijn Sequences Revisited
A (non-circular) de Bruijn sequence w of order n is a word such that every word of length n appears exactly once in w as a factor. In this paper, we generalize the concept to different settings: the multi-shift de Bruijn sequence and the pseudo de Bruijn sequence. An m-shift de Bruijn sequence of order n is a word such that every word of length n appears exactly once in w as a factor that start...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.07.019